On comparing ray shooting algorithms

نویسندگان

  • Vlastimil Havran
  • Werner Purgathofer
چکیده

In this paper we discuss a methodology for comparing various ray shooting algorithms through a set of experiments performed on a set of scenes. We develop a computational model for ray shooting algorithms, which allows us to map any particular ray shooting algorithm to the computational model. Further, we develop a performance model for ray shooting algorithms, which establishes the correspondence between the computational model and the running time of the ray shooting algorithm for a sequence of ray shooting queries. Based on these computational and performance models, we propose a set of parameters describing the use of a ray shooting algorithm in applications. These parameters allows us to make a fair comparison of various ray shooting algorithms for the same set of input data, i.e., the same scene and the same sequence of ray shooting queries, but virtually independently of hardware and implementation issues. Under certain conditions, the proposed comparison methodology enables cross-comparison of published research work without reimplementation of other ray shooting algorithms. r 2003 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DISSERTATION THESIS Heuristic Ray Shooting Algorithms

Global illumination research aiming at the photo-realistic image synthesis pushes forward research in computer graphics as a whole. The computation of visually plausible images is time-consuming and far from being realtime at present. A significant part of computation in global illumination algorithms involves repetitive computing of visibility queries. In the thesis, we describe our results in...

متن کامل

On Improving Kd Tree for Ray Shooting

Efficient ray shooting algorithm is inherently required by many computer graphics algorithms, particularly in image synthesis. Practical ray shooting algorithms aiming at the average-case complexity use some underlying spatial data structure such as kd-tree. We show the new termination criteria algorithm that improves the space and time complexity of the kd-tree construction. It provides effici...

متن کامل

Ouch! How Embodied Damage Indicators in First-Person Shooting Games Impact Gaming Experience

In this paper we present results from an exploratory study on firstperson shooting game damage indicators, comparing a red flash, a paper doll, and an x-ray mechanism, observing impact on gaming experience.

متن کامل

A Theoretical Comparison of Monte Carlo Radiosity Algorithms

In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete collision shooting random walks and stochastic Jacobi iterations. We show that the variance of these three algorithms is in practice to very good approximation identical, explaining empirical results obtained before. The d...

متن کامل

Theoretical and Experimental Aspects of Ray Shooting

The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics and radio propagation simulation wireless communications among others. Unfortunately, theoretical solutions to the problem are not very practical, while practical methods offer few provable guarantees on performance. The two main obstacles appear to be identifying the correct measu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2003